182 research outputs found

    A Novel Method for the Absolute Pose Problem with Pairwise Constraints

    Full text link
    Absolute pose estimation is a fundamental problem in computer vision, and it is a typical parameter estimation problem, meaning that efforts to solve it will always suffer from outlier-contaminated data. Conventionally, for a fixed dimensionality d and the number of measurements N, a robust estimation problem cannot be solved faster than O(N^d). Furthermore, it is almost impossible to remove d from the exponent of the runtime of a globally optimal algorithm. However, absolute pose estimation is a geometric parameter estimation problem, and thus has special constraints. In this paper, we consider pairwise constraints and propose a globally optimal algorithm for solving the absolute pose estimation problem. The proposed algorithm has a linear complexity in the number of correspondences at a given outlier ratio. Concretely, we first decouple the rotation and the translation subproblems by utilizing the pairwise constraints, and then we solve the rotation subproblem using the branch-and-bound algorithm. Lastly, we estimate the translation based on the known rotation by using another branch-and-bound algorithm. The advantages of our method are demonstrated via thorough testing on both synthetic and real-world dataComment: 10 pages, 7figure

    Quantum algebra of multiparameter Manin matrices

    Full text link
    Multiparametric quantum semigroups Mq^,p^(n)\mathrm{M}_{\hat{q}, \hat{p}}(n) are generalization of the one-parameter general linear semigroups Mq(n)\mathrm{M}_q(n), where q^=(qij)\hat{q}=(q_{ij}) and p^=(pij)\hat{p}=(p_{ij}) are 2n22n^2 parameters satisfying certain conditions. In this paper, we study the algebra of multiparametric Manin matrices using the R-matrix method. The systematic approach enables us to obtain several classical identities such as Muir identities, Newton's identities, Capelli-type identities, Cauchy-Binet's identity both for determinant and permanent as well as a rigorous proof of the MacMahon master equation for the quantum algebra of multiparametric Manin matrices. Some of the generalized identities are also generalized to multiparameter qq-Yangians.Comment: 31 pages; final versio

    Selective Determination of Pyridine Alkaloids in Tobacco by PFTBA Ions/Analyte Molecule Reaction Ionization Ion Trap Mass Spectrometry

    Get PDF
    The application of perfluorotributylamine (PFTBA) ions/analyte molecule reaction ionization for the selective determination of tobacco pyridine alkaloids by ion trap mass spectrometry (IT-MS) is reported. The main three PFTBA ions (CF3+, C3F5+, and C5F10N+) are generated in the external source and then introduced into ion trap for reaction with analytes. Because the existence of the tertiary nitrogen atom in the pyridine makes it possible for PFTBA ions to react smoothly with pyridine and forms adduct ions, pyridine alkaloids in tobacco were selectively ionized and formed quasi-molecular ion [M + H]+and adduct ions, including [M + 69]+, [M + 131]+, and [M + 264]+, in IT-MS. These ions had distinct abundances and were regarded as the diagnostic ions of each tobacco pyridine alkaloid for quantitative analysis in selected-ion monitoring mode. Results show that the limit of detection is 0.2 μg/mL, and the relative standard deviations for the seven alkaloids are in the range of 0.71% to 6.8%, and good recovery of 95.6% and 97.2%. The proposed method provides substantially greater selectivity and sensitivity compared with the conventional approach and offers an alternative approach for analysis of tobacco alkaloids

    Transformation Decoupling Strategy based on Screw Theory for Deterministic Point Cloud Registration with Gravity Prior

    Full text link
    Point cloud registration is challenging in the presence of heavy outlier correspondences. This paper focuses on addressing the robust correspondence-based registration problem with gravity prior that often arises in practice. The gravity directions are typically obtained by inertial measurement units (IMUs) and can reduce the degree of freedom (DOF) of rotation from 3 to 1. We propose a novel transformation decoupling strategy by leveraging screw theory. This strategy decomposes the original 4-DOF problem into three sub-problems with 1-DOF, 2-DOF, and 1-DOF, respectively, thereby enhancing the computation efficiency. Specifically, the first 1-DOF represents the translation along the rotation axis and we propose an interval stabbing-based method to solve it. The second 2-DOF represents the pole which is an auxiliary variable in screw theory and we utilize a branch-and-bound method to solve it. The last 1-DOF represents the rotation angle and we propose a global voting method for its estimation. The proposed method sequentially solves three consensus maximization sub-problems, leading to efficient and deterministic registration. In particular, it can even handle the correspondence-free registration problem due to its significant robustness. Extensive experiments on both synthetic and real-world datasets demonstrate that our method is more efficient and robust than state-of-the-art methods, even when dealing with outlier rates exceeding 99%

    Utility-Based Joint Routing, Network Coding, and Power Control for Wireless Ad Hoc Networks

    Get PDF
    Energy saving and high delivery reliability are two essential metrics in wireless ad hoc networks. In this paper, we propose a joint power control and network coding (PCNC) scheme which regulates the transmission power to reduce the overall energy usage and uses network coding to improve reliability by reducing the number of packet retransmissions. To argue for PCNC scheme, we investigate both unicast and multicast routing scenarios. To evaluate routing optimality, we adopt expected utility as a metric, which integrates energy cost, reliability, and benefit value. Based on the expected utility, we explore the optimality in both unicast and multicast routing. For unicast routing, we propose an optimal algorithm. We show the NP-hardness of multicast routing problem, and also design a heuristic solution. Results from simulations demonstrate that PCNC improves the performance in terms of expected utility compared with existing techniques
    • …
    corecore